Partitions and Edge Colourings of Multigraphs
نویسندگان
چکیده
Erdős and Lovász conjectured in 1968 that for every graph G with χ(G) > ω(G) and any two integers s, t ≥ 2 with s+ t = χ(G)+1, there is a partition (S, T ) of the vertex set V (G) such that χ(G[S]) ≥ s and χ(G[T ]) ≥ t. Except for a few cases, this conjecture is still unsolved. In this note we prove the conjecture for line graphs of multigraphs.
منابع مشابه
Some maximum multigraphs and adge/vertex distance colourings
Shannon–Vizing–type problems concerning the upper bound for a distance chromatic index of multigraphs G in terms of the maximum degree ∆(G) are studied. Conjectures generalizing those related to the strong chromatic index are presented. The chromatic d–index and chromatic d–number of paths, cycles, trees and some hypercubes are determined. Among hypercubes, however, the exact order of their gro...
متن کاملList Edge Colourings of Some 1-Factorable Multigraphs
The List Edge Colouring Conjecture asserts that, given any multigraph G with chromatic index k and any set system fSe : e 2 E(G)g with each jSej = k, we can choose elements se 2 Se such that se 6 = sf whenever e and f are adjacent edges. Using a technique of Alon and Tarsi which involves the graph monomial Q fxu ? xv : uv 2 Eg of an oriented graph, we verify this conjecture for certain families...
متن کاملFrugal Colouring of Graphs
A k-frugal colouring of a graph G is a proper colouring of the vertices of G such that no colour appears more than k times in the neighbourhood of a vertex. This type of colouring was introduced by Hind, Molloy and Reed in 1997. In this paper, we study the frugal chromatic number of planar graphs, planar graphs with large girth, and outerplanar graphs, and relate this parameter with several wel...
متن کاملColourings, homomorphisms, and partitions of transitive digraphs
We investigate the complexity of generalizations of colourings (acyclic colourings, (k, `)colourings, homomorphisms, and matrix partitions), for the class of transitive digraphs. Even though transitive digraphs are nicely structured, many problems are intractable, and their complexity turns out to be difficult to classify. We present some motivational results and several open problems.
متن کاملClique partitions of distance multigraphs
We consider the minimum number of cliques needed to partition the edge set of D(G), the distance multigraph of a simple graph G. Equivalently, we seek to minimize the number of elements needed to label the vertices of a simple graph G by sets so that the distance between two vertices equals the cardinality of the intersection of their labels. We use a fractional analogue of this parameter to fi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. J. Comb.
دوره 15 شماره
صفحات -
تاریخ انتشار 2008